Enumerating Consecutive and Nested Partitions for Graphs
نویسندگان
چکیده
منابع مشابه
Enumerating Consecutive and Nested Partitions for Graphs
Consecutive and nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is considered consecutive if the subgraph induced by the subset is connected. In this sense the partition p...
متن کاملOptimality of consecutive and nested tree partitions
We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called consecutive partitions and nested partitions, have been well studied for the set partition problem, w...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملNested Partitions Using Texture Segmentation
A multi-step method of partitioning the pixels of an image such that the partitions at one step are wholly nested inside the partitions of the next step is described, i.e. we describe an agglomerative, hierarchical segmentation technique that uses texture information to perform the segmentation. The image is requantized using K-Means clustering. Then, clusters are expanded using region growing ...
متن کاملAsymptotic expansions for enumerating connected labelled graphs
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k = m−n. I thus identify an error in a recent paper of Flajolet et al.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1998
ISSN: 0195-6698
DOI: 10.1006/eujc.1997.0145